Generating Fast Indulgent Algorithms

Indulgent Algorithms ∗ ( Extended

Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterizes such algorithms and states some of their interesting features. We show that indulgent algorithms are inherently safe and uniform. We also state impossibility results for indulgent solutions to diverg...

Fast Indulgent Consensus with Zero Degradation

Fast Algorithms for Generating Integer Partitions

We present two new algorithms for generating integer partitions in the standard representation. They generate partitions in lexicographic and antilexicographic order, respectively. We prove that both algorithm generate partitions with constant average delay, exclusive of the output. The performance of all known integer partition algorithms is measured and compared, separately for the standard a...

Fast Algorithms for Generating Delaunay Interpolation Elements for Domain Decomposition

This work is motivated by the need to pass information eeciently among subdomains when solving partial diierential equations with a domain decomposition approach. Because of ever greater demands for exibility, no restrictive assumptions are made about the grids used to discretize the subdomains. Indeed, the union of all grid eld points is treated as a general collection of points from which inf...

The Alpha of Indulgent Consensus

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we introduce here, called Alpha, and which precisely captures consensus safety. Implementations of Alpha in shared memory, storage area network, mes...